Multi-Bale Handling Unit for Efficient Logistics
نویسندگان
چکیده
منابع مشابه
Efficient Multi-unit Auctions for Normal Goods
I study efficient multi-unit auction design when bidders have private values, multiunit demands, and non-quasilinear preferences. Without quasilinearity, the Vickrey auction loses its desired incentive and efficiency properties. Instead of assuming that bidders have quasilinear preferences, I assume that bidders have positive wealth effects. This nests cases where bidders are risk averse, face ...
متن کاملAn Efficient Multi-Unit Ascending Auction
We provide an ascending auction that yields an efficient outcome when there are many identical units for sale and bidders have interdependent values and downward-sloping demand. Our ascending auction both extends and generalizes Ausubel’s (2004) and yields the same outcome as Perry and Reny’s (2002) generalization of Vickrey’s (1961) sealed-bid auction. There are two key features of our auction...
متن کاملEfficient Privacy-Preserving Protocols for Multi-unit Auctions
The purpose of multi-unit auctions is to allocate identical units of a single type of good to multiple agents. Besides well-known applications like the selling of treasury bills, electrical power, or spectrum licenses, multi-unit auctions are also well-suited for allocating CPU time slots or network bandwidth in computational multiagent systems. A crucial problem in sealed-bid auctions is the l...
متن کاملEfficient Winner Determination Techniques for Internet Multi-Unit Auctions
In this paper we develop algorithms for efficiently processing bids in a single item, N unit ( N ≥ 1) open cry auction for a large class of winner determination rules. Existing techniques consider all previously submitted bids along with the new arrivals to update the current set of winners. We propose that at most N “potential winner bids” amongst the previously submitted bids need to be used ...
متن کاملComputationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner determination problem is an NP-hard problem that can be mapped into an integer program. Nonetheless, the computational cost of the current solution hinders the application of mixed multi-unit combinatorial auctions to reali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AgriEngineering
سال: 2020
ISSN: 2624-7402
DOI: 10.3390/agriengineering2020023